On Logics of Strategic Ability Based on Propositional Control
نویسندگان
چکیده
Recently logics for strategic ability have gained pre-eminence in the modelisation and analysis of game-theoretic scenarios. In this paper we provide a contribution to the comparison of two popular frameworks: Concurrent Game Structures (CGS) and Coalition Logic of Propositional Control (CLPC). Specifically, we ground the abstract abilities of agents in CGS on Propositional Control, thus obtaining a class of CGS that has the same expressive power as CL-PC. We study the computational properties of this setting. Further, we relax some of the assumptions of CL-PC so as to introduce a wider class of computationally-grounded CGS.
منابع مشابه
The Ceteris Paribus Structure of Logics of Game Forms
The article introduces a ceteris paribus modal logic, called CP, interpreted on the equivalence classes induced by finite sets of propositional atoms. This logic is studied and then used to embed three logics of strategic interaction, namely atemporal STIT, the coalition logic of propositional control (CL−PC) and the starless fragment of the dynamic logic of propositional assignments (DL−PA). T...
متن کاملDesign of An Intelligent Model for Strategic Planning in Mineral Holding: Case study, Shahab-Sang Holding
Business logic is one of the most important logics based on the decision matrix. However, using this logic alone and environmental uncertainty leads to problems such as low accuracy and integrity in strategic planning. In this work, we use an intelligent model based on the neural-fuzzy approach aiming at a desired decision-making and reducing the uncertainty in the strategic planning in mineral...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملOn the logic of cooperation and propositional control
Cooperation logics have recently begun to attract attention within the multi-agent systems community. Using a cooperation logic, it is possible to represent and reason about the strategic powers of agents and coalitions of agents in game-like multi-agent systems. These powers are generally assumed to be implicitly defined within the structure of the environment, and their origin is rarely discu...
متن کاملUndecidability of a Very Simple Modal Logic with Binding
We show undecidability of the satisfiability problem of what is arguably the simplest non-sub-Boolean modal logic with an implicit notion of binding. This work enriches the series of existing results of undecidability of modal logics with binders, which started with Hybrid Logics and continued with Memory Logics. 1 Modal Logics, Names and Binders Modal Logics are languages that are able to desc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016